Representing Bayesian Networks Within Probabilistic Horn Abduction
نویسنده
چکیده
This paper presents a simple framework for Horn clause abduction, with probabilities associated with hypotheses. It is shown how this representation can represent any probabilistic knowledge representable in a Bayesian belief network. The main contributions are in finding a relationship between logical and prob abilistic notions of evidential reasoning. This can be used as a basis for a new way to implement Bayesian Networks that allows for approximations to the value of the posterior probabilities, and also points to a way that Bayesian networks can be extended beyond a propositional language.
منابع مشابه
Probabilistic Horn Abduction and Bayesian Networks
This paper presents a simple framework for Horn clause abduc tion with probabilities associated with hypotheses The framework incorporates assumptions about the rule base and independence as sumptions amongst hypotheses It is shown how any probabilistic knowledge representable in a discrete Bayesian belief network can be represented in this framework The main contribution is in nding a relation...
متن کاملFrom Probabilistic Horn Logic to Chain Logic
Probabilistic logics have attracted a great deal of attention during the past few years. Where logical languages have, already from the inception of the field of artificial intelligence, taken a central position in research on knowledge representation and automated reasoning, probabilistic graphical models with their associated probabilistic basis have taken up in recent years a similar positio...
متن کاملProbability Propagation Nets
This work introduces a Petri net representation for the propagation of probabilities and likelihoods, which can be applied to probabilistic Horn abduction, fault trees, and Bayesian networks. These so-called “probability propagation nets” increase the transparency of propagation processes by integrating structural and dynamical aspects into one homogeneous representation. It is shown by means o...
متن کاملA Viterbi-like algorithm and EM learning for statistical abduction
We propose statistical abduction as a rstorder logical framework for representing and learning probabilistic knowledge. It combines logical abduction with a parameterized distribution over abducibles. We show that probability computation, a Viterbilike algorithm and EM learning for statistical abduction achieve the same eÆciency as specilzed algorithms for HMMs (hidden Markov models), PCFGs (pr...
متن کاملRepresenting Diagnostic Knowledge for Probabilistic Horn Abduction
This paper presents a simple logical framework for abduction, with probabilities associated with hypotheses. The language is an extension to pure Prolog, and it has straight-forward implementations using branch and bound search with either logic-programming technology or ATMS technology. The main focus of this paper is arguing for a form of representational adequacy of this very simple system f...
متن کامل